In mathematics, a square root of a number x is a number r such that r2 = x, or, in other words, a number r whose square (the result of multiplying the number by itself, or r × r) is x.
Every non-negative real number x has a unique non-negative square root, called the principal square root, denoted by a radical sign as . For positive x, the principal square root can also be written in exponent notation, as x1/2. For example, the principal square root of 9 is 3, denoted , because 32 = 3 × 3 = 9 and 3 is non-negative. Although the principal square root of a positive number is only one of its two square roots, the designation "the square root" is often used to refer to the principal square root.
Every positive number x has two square roots. One of them is , which is positive, and the other , which is negative. Together, these two roots are denoted (see ± shorthand). Square roots of negative numbers can be discussed within the framework of complex numbers. More generally, square roots can be considered in any context in which a notion of "squaring" of some mathematical objects is defined (including algebras of matrices, endomorphism rings, etc).
Square roots of integers that are not perfect squares are always irrational numbers: numbers not expressible as a ratio of two integers. For example, cannot be written exactly as m/n, where n and m are integers. Nonetheless, it is exactly the length of the diagonal of a square with side length 1. This has been known since ancient times, with the discovery that is irrational attributed to Hippasus, a disciple of Pythagoras.
The term whose root is being considered is known as the radicand. For example, in the expression , ab + 2 is the radicand. The radicand is the number or expression underneath the radical sign.
Contents |
The principal square root function (usually just referred to as the "square root function") is a function that maps the set of non-negative real numbers onto itself. In geometrical terms, the square root function maps the area of a square to its side length.
The square root of x is rational if and only if x is a rational number that can be represented as a ratio of two perfect squares. (See square root of 2 for proofs that this is an irrational number, and quadratic irrational for a proof for all non-square natural numbers.) The square root function maps rational numbers into algebraic numbers (a superset of the rational numbers).
For all real numbers x
For all non-negative real numbers x and y,
and
The square root function is continuous for all non-negative x and differentiable for all positive x. If f denotes the square-root function, its derivative is given by:
The Taylor series of √1 + x about x = 0 converges for |x| < 1 and is given by
Most pocket calculators have a square root key. Computer spreadsheets and other software are also frequently used to calculate square roots. Pocket calculators typically implement good routines to compute the exponential function and the natural logarithm or logarithm, and then compute the square root of a positive real number x using the identity
The same identity is exploited when computing square roots with logarithm tables or slide rules.
The most common iterative method of square root calculation by hand is known as the "Babylonian method" or "Heron's method" after the first century Greek philosopher Heron of Alexandria who first described it.[1] The technique is an application of the Newton-Raphson iterative solution method to the function , using the fact that its slope at any point is . [2] It involves a simple algorithm, which results in a number closer to the actual square root each time it is repeated. To find x, the square root of a non-negative real number a:
(It is sufficient to take an approximate value of the average to ensure convergence)
If a is positive, the convergence is "quadratic," which means that in approaching the limit, the number of correct digits roughly doubles in each next iteration. If a = 0, the convergence is only linear.
Using the identity
the computation of the square root of a positive number can be reduced to that of a number in the range [1, 4). This simplifies finding a start value for the iterative method that is close to the square root, for which a polynomial or piecewise-linear approximation can be used.
The time complexity for computing a square root with n digits of precision is equivalent to that of multiplying two n-digit numbers.
The square of any positive or negative number is positive, and the square of 0 is 0. Therefore, no negative number can have a real square root. However, it is possible to work with a more inclusive set of numbers, called the complex numbers, that does contain solutions to the square root of a negative number. This is done by introducing a new number, denoted by i (sometimes j, especially in the context of electricity where "i" traditionally represents electric current) and called the imaginary unit, which is defined such that i2 = −1. Using this notation, we can think of i as the square root of −1, but notice that we also have (−i)2 = i2 = −1 and so −i is also a square root of −1. By convention, the principal square root of −1 is i, or more generally, if x is any positive number, then the principal square root of −x is
The right side (as well as its negative) is indeed a square root of −x, since
For every non-zero complex number z there exist precisely two numbers w such that w2 = z: the principal square root of z (defined below), and its negative.
The square root of i is given by
This result can be obtained algebraically by finding a and b such that
or equivalently
This gives the two simultaneous equations
with solutions
The choice of the principal root then gives
The result can also be obtained by using de Moivre's formula and setting
which produces
To find a definition for the square root that allows us to consistently choose a single value, called the principal value, we start by observing that any complex number x + iy can be viewed as a point in the plane, (x, y), expressed using Cartesian coordinates. The same point may be reinterpreted using polar coordinates as the pair (r, Φ), where r ≥ 0 is the distance of the point from the origin, and Φ is the angle that the line from the origin to the point makes with the positive real (x) axis. In complex analysis, this value is conventionally written r eiΦ. If
then we define the principal square root of z as follows:
The principal square root function is thus defined using the nonpositive real axis as a branch cut. The principal square root function is holomorphic everywhere except on the set of non-positive real numbers (where it isn't even continuous). The above Taylor series for √1 + x remains valid for complex numbers x with |x| < 1.
When the number is in rectangular form the following formula can be used for the principal value:
where
is the absolute value or modulus of the original number, and the sign of the imaginary part of the root is taken to be same as the sign of the imaginary part of the original number. The real part of the principal value is always non-negative.[3]
Because of the discontinuous nature of the square root function in the complex plane, the law √zw = √z√w is in general not true. (Equivalently, the problem occurs because of the freedom in the choice of branch. The chosen branch may or may not yield the equality; in fact, the choice of branch for the square root need not contain the value of √z√w at all, leading to the equality's failure. A similar problem appears with the complex logarithm and the relation log z + log w = log(zw).) Wrongly assuming this law underlies several faulty "proofs", for instance the following one showing that −1 = 1:
The third equality cannot be justified (see invalid proof). It can be made to hold by changing the meaning of √ so that this no longer represents the principal square root (see above) but selects a branch for the square root that contains (√−1)·(√−1). The left hand side becomes either
if the branch includes +i or
if the branch includes −i, while the right hand side becomes
where the last equality, √1 = −1, is a consequence of the choice of branch in the redefinition of √.
If A is a positive-definite matrix or operator, then there exists precisely one positive definite matrix or operator B with B2 = A; we then define √A = B.
More generally, to every normal matrix or operator A there exist normal operators B such that B2 = A. In general, there are several such operators B for every A and the square root function cannot be defined for normal operators in a satisfactory manner. Positive definite operators are akin to positive real numbers, and normal operators are akin to complex numbers.
The square roots of the perfect squares (1, 4, 9, 16, etc.) are integers. In all other cases, the square roots are irrational numbers, and therefore their decimal representations are non-repeating decimals.
1 | |||
1.414213562373095048801688724209698078569671875376948073176679737990732478462 | 1 million digits, 2 million, 5 million, 10 million | ||
1.732050807568877293527446341505872366942805253810380628055806979451933016909 | 1 million digits | ||
2 | |||
2.236067977499789696409173668731276235440618359611525724270897245410520925638 | 1 million digits | ||
2.449489742783178098197284074705891391965947480656670128432692567250960377457 | 1 million digits | ||
2.645751311064590590501615753639260425710259183082450180368334459201068823230 | 1 million digits | ||
2.828427124746190097603377448419396157139343750753896146353359475981464956924 | 1 million digits | ||
3 | |||
3.162277660168379331998893544432718533719555139325216826857504852792594438639 | 1 million digits | ||
3.316624790355399849114932736670686683927088545589353597058682146116484642609 | |||
3.464101615137754587054892683011744733885610507620761256111613958903866033818 | |||
3.605551275463989293119221267470495946251296573845246212710453056227166948293 | |||
3.741657386773941385583748732316549301756019807778726946303745467320035156307 | |||
3.872983346207416885179265399782399610832921705291590826587573766113483091937 | |||
4 | |||
4.123105625617660549821409855974077025147199225373620434398633573094954346338 | |||
4.242640687119285146405066172629094235709015626130844219530039213972197435386 | |||
4.358898943540673552236981983859615659137003925232444936890344138159557328203 | |||
4.472135954999579392818347337462552470881236719223051448541794490821041851276 |
The square roots of the perfect squares (1, 4, 9, 16, etc.) are integers. In all other cases, the square roots are irrational numbers, and therefore their representations in any standard positional notation system are non-repeating.
The square roots of small integers are used in both the SHA-1 and SHA-2 hash function designs to provide nothing up my sleeve numbers.
One of the most intriguing results from the study of irrational numbers as continued fractions was obtained by Joseph Louis Lagrange circa 1780. Lagrange found that the representation of the square root of any non-square positive integer as a continued fraction is periodic. That is, a certain pattern of partial denominators repeats indefinitely in the continued fraction. In a sense these square roots are the very simplest irrational numbers, because they can be represented with a simple repeating pattern of integers.
[1; 2, 2, ...] | ||
[1; 1, 2, 1, 2, ...] | ||
[2] | ||
[2; 4, 4, ...] | ||
[2; 2, 4, 2, 4, ...] | ||
[2; 1, 1, 1, 4, 1, 1, 1, 4, ...] | ||
[2; 1, 4, 1, 4, ...] | ||
[3] | ||
[3; 6, 6, ...] | ||
[3; 3, 6, 3, 6, ...] | ||
[3; 2, 6, 2, 6, ...] | ||
[3; 1, 1, 1, 1, 6, 1, 1, 1, 1, 6, ...] | ||
[3; 1, 2, 1, 6, 1, 2, 1, 6, ...] | ||
[3; 1, 6, 1, 6, ...] | ||
[4] | ||
[4; 8, 8, ...] | ||
[4; 4, 8, 4, 8, ...] | ||
[4; 2, 1, 3, 1, 2, 8, 2, 1, 3, 1, 2, 8, ...] | ||
[4; 2, 8, 2, 8, ...] |
The square bracket notation used above is a sort of mathematical shorthand to conserve space. Written in more traditional notation the simple continued fraction for the square root of 11 – [3; 3, 6, 3, 6, ...] – looks like this:
where the two-digit pattern {3, 6} repeats over and over and over again in the partial denominators.
A square root can be constructed with a compass and straightedge. In his Elements, Euclid (fl. 300 BC) gave the construction of the geometric mean of two quantities in two different places: Proposition II.14 and Proposition VI.13. Since the geometric mean of a and b is , one can construct simply by taking b = 1.
The construction is also given by Descartes in his La Géométrie, see figure 2 on page 2. However, Descartes made no claim to originality and his audience would have been quite familiar with Euclid.
Another method of geometric construction uses right triangles and induction: can, of course, be constructed, and once has been constructed, the right triangle with 1 and for its legs has a hypotenuse of . The Spiral of Theodorus is constructed using successive square roots in this manner.
The Yale Babylonian Collection YBC 7289 clay tablet was created between 1800 BC and 1600 BC, showing and as 1;24,51,10 and 42;25,35 base 60 numbers on a square crossed by two diagonals.[4]
The Rhind Mathematical Papyrus is a copy from 1650 BC of an even earlier work and shows us how the Egyptians extracted square roots.[5]
In Ancient India, the knowledge of theoretical and applied aspects of square and square root was at least as old as the Sulba Sutras, dated around 800-500 B.C. (possibly much earlier). A method for finding very good approximations to the square roots of 2 and 3 are given in the Baudhayana Sulba Sutra.[6] Aryabhata in the Aryabhatiya (section 2.4), has given a method for finding the square root of numbers having many digits.
In the Chinese mathematical work Writings on Reckoning, written between 202 BC and 186 BC during the early Han Dynasty, the square root is approximated by using an "excess and deficiency" method, which says to "...combine the excess and deficiency as the divisor; (taking) the deficiency numerator multiplied by the excess denominator and the excess numerator times the deficiency denominator, combine them as the dividend."[7]
According to historian of mathematics D.E. Smith, Aryabhata's method for finding the square root was first introduced in Europe by Cataneo in 1546.[8]
The symbol √ for the square root was first used in print in 1525 in Christoph Rudolff's Coss, which was also the first to use the then-new signs '+' and '-'.[9]